Generalized swarm intelligence algorithms with domain-specific heuristics

<span lang="EN-US">In recent years, hybrid approaches on population-based algorithms are more often applied in industrial settings. In this paper, we present the approach of a combination universal, problem-free Swarm Intelligence (SI) with simple deterministic domain-specific heuristic algorithms. The focuses improving efficiency by sharing advantages and swarm A algorithm helps take into account specifics problem effectively translate positions agents (particle, ant, bee) problem's solution. And provides an increase adaptability due to stochastic self-organized properties. We demonstrate two non-trivial optimization tasks: scheduling finding minimum distance between 3D isomers.</span>